Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings

نویسنده

Nikita Danilenko

چکیده

We show how to develop a purely functional algorithm that computes maximum matchings in bipartite graphs by using relation algebra. Our algorithm is based upon the representation of graphs by lists of successor lists and a generalisation to specific container types is discussed. The algorithm itself can be implemented in Haskell and we will provide a complete implementation using the successor list model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semi-matchings for Bipartite Graphs and Load Balancing

We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it is a relaxation of the known bipartite matching problem. We present a way to evaluate the quality of a given semi-matching and show that, under this measure, an optimal semi-matching balances the load on the right han...

متن کامل

Zarankiewicz Numbers and Bipartite Ramsey Numbers

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...

متن کامل

Solving Matching Problems Efficiently in Bipartite Graphs

We investigate the problem maxDMM of computing a largest set of pairwise disjoint maximum matchings in undirected graphs as introduced by P. J. Slater in the case of trees. In this paper, n, m denote, respectively, the number of vertices and the number of edges. We solve maxDMM for bipartite graphs, by providing an O(n 1.5 m/ log n + mn log n)-time algorithm. We design better algorithms for com...

متن کامل

A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees

Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be log x/ log(x/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O( √ nW/k(n,W/N))-time algorithm for computing a maximum weight matching of G. T...

متن کامل